Quasiprobability Distribution Functions from Fractional Fourier Transforms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self Fourier functions and fractional Fourier transforms

It was shown [ 21 that any SFF can be decomposed in this manner. Thus, F(x) is an SFF if, and only if, it can be expressed as the sum of four functions in the form of the above equation. Additional SFF studies are reported in refs. [ 3-51. Another issue that has been recently investigated is the fractional Fourier transform [ 6-91. Two distinct definitions of the fractional Fourier transform ha...

متن کامل

Discrete Morse Functions from Fourier Transforms

A discrete Morse function for a simplicial complex describes how to construct a homotopy equivalent CW-complex with hopefully fewer cells. We associate a boolean function with the simplicial complex and construct a discrete Morse function using its Fourier transform. Methods from theoretical computer science by O’Donnell, Saks, Schramm, and Servedio, together with experimental data on complexes...

متن کامل

On the fractional Fourier and continuous fractional wave packet transforms of almost periodic functions

We state the fractional Fourier transform and the continuous fractional wave packet transform as ways for analyzing persistent signals such as almost periodic functions and strong limit power signals. We construct frame decompositions for almost periodic functions using these two transforms. Also a norm equality of this signal is given using the continuous fractional wave packet transform.

متن کامل

Discrete Fractional Hartley and Fourier Transforms

This paper is concerned with the definitions of the discrete fractional Hartley transform (DFRHT) and the discrete fractional Fourier transform (DFRFT). First, the eigenvalues and eigenvectors of the discrete Fourier and Hartley transform matrices are investigated. Then, the results of the eigendecompositions of the transform matrices are used to define DFRHT and DFRFT. Also, an important relat...

متن کامل

Fast algorithms for fractional Fourier transforms

The fractional Fourier transform (FRFT) is a one-parametric generalization of the classical Fourier transform. The FRFT was introduced in the 80th and has found a lot of applications and is now used widely in signal processing. Both the space and the spatial frequency domains, respectively, are special cases of the fractional Fourier domains. They correspond to the 0th and 1st fractional Fourie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2019

ISSN: 2073-8994

DOI: 10.3390/sym11030344